Interestingness measure on privacy preserved data with horizontal partitioning

Association rule mining is a process of finding the frequent item sets based on the interestingness measure. The major challenge exists when performing the association of the data where privacy preservation is emphasized. The actual transaction data provides the evident to calculate the parameters for defining the association rules. In this paper, a solution is proposed to find one such parameter i.e. support count for item sets on the non transparent data, in other words the transaction data is not disclosed. The privacy preservation is ensured by transferring the x-anonymous records for every transaction record. All the anonymous set of actual transaction record perceives high generalized values. The clients process the anonymous set of every transaction record to arrive at high abstract values and these generalized values are used for support calculation. More the number of anonymous records, more the privacy of data is amplified. In experimental results it is shown that privacy is ensured with more number of formatted transactions

TKP: Three level key pre-distribution with mobile sinks for wireless sensor networks

Wireless Sensor Networks are by its nature prone to various forms of security attacks. Authentication and secure communication have become the need of the day. Due to single point failure of a sink node or base station, mobile sinks are better in many wireless sensor networks applications for efficient data collection or aggregation, localized sensor reprogramming and for revoking compromised sensors. The existing sytems that make use of key predistribution schemes for pairwise key establishment between sensor nodes and mobile sinks, deploying mobile sinks for data collection has drawbacks. Here, an attacker can easily obtain many keys by capturing a few nodes and can gain control of the network by deploying a node preloaded with some compromised keys that will be the replica of compromised mobile sink. We propose an efficient three level key predistribution framework that uses any pairwise key predistribution in different levels. The new framework has two set of key pools one set of keys for the mobile sink nodes to access the sensor network and other set of keys for secure communication among the sensor nodes. It reduces the damage caused by mobile sink replication attack and stationary access node replication attack. To further reduce the communication time it uses a shortest distance to make pair between the nodes for comunication. Through results, we show that our security framework has a higher network resilience to a mobile sink replication attack as compared to the polynomial pool-based scheme with less communication tim

Semi-Supervised Domain Adaptation and Collaborative Deep Learning for Dual Sentiment Analysis

Sentiment classification is a much needed topic that has grabbed the interest of many researchers. Especially, classification of data from customer reviews on various commercial products has been an important source of research. A model called supervised dual sentiment analysis is used to handle the polarity shift problem that occurs in sentiment classification. Labeling the reviews is a tedious and time consuming process. Even, a classifier trained on one domain may not perform well on the other domain. To overcome these limitations, in this paper we propose semi-supervised domain adaptive dual sentiment analysis that train a domain independent classifier with few labeled data. Reviews are of varying length and hence, classification is more accurate if long term dependency between the words is considered. We propose a collaborative deep learning approach to the dual sentiment analysis. Long short term memory (LSTM) recurrent neural network is used to handle sequence prediction to classify the reviews more accurately. LSTM takes more time to extract features from the reviews. Convolution neural network is used before LSTM layers to extract features resulting in the reduction of training time compared to LSTM alone

A Progressive Approach to Enhance Lifetime for Barrier Coverage in Wireless Sensor Network

Wireless sensor networks have their applications deployed in all the fields of area of research beyond the visualization of smart sensors. The sensors installed may experience many coverage related faults e.g., Barrier coverage problem. This problem affects the random deployment in sensor network to conserve energy and therefore has to be rectified, confined and approved. The protocol CSP andVSP defined extends the advantageoreducingtheenergyconsumption and increases the lifetime of sensor nodes with the intrusion detection model over heterogeneous deployment. Inspite of low connectivity and multihop signal paths, the protocols is entirely scalabl e in terms of computational control and communication bandwidth. Two diverse cases are employed between th e nodes with the protocols: position to position connectivity and load balancing. The former produces better results with a linear increase in network lifetime whereas through latter achieves 40 percent of energy utilization. Simul ation results are provide d to display the efficiency of the protocol designed

TIME OPTIMIZATION FOR AUTHENTIC AND ANONYMOUS GROUP SHARING IN CLOUD STORAGE

The Cloud computing is a rising technique which offers information sharing are more, and efficient effective economical approaches between group members. To create an authentic and anonymous information sharing, IDentity based Ring Signature (ID-) is one of the promising method between the groups. Ring signature RS conspire grants the chief or data owner to authenticate into the framework in an anonymous way. In conventional Public Key Infrastructure (PKI) information sharing plan contains certificate authentication process, which is a bottleneck due to its high cost for consumption of more time to signature. To maintain a strategic distance from this issue, we proposed Cost Optimized Identity-based Ring Signature with forward secrecy COIRS () scheme. This plan evacuates the traditional certificate verification process. Just once the client should be confirmed by the chief giving his public details. The time required for this procedure is relatively not as much as customary public key framework. If the secret key holder has been compromised, all early generated signatures remain valid (Forward Secrecy). This paper examines how to optimize the time when sharing the documents to the cloud. We provide a protection from collision attack, which means revoked users will not get the original documents. In general better efficiency and secrecy can be provided for group sharing by applying approaches

Sentiment analysis and opinion mining from social media: A review

Ubiquitous presence of internet, advent of web 2.0 has made social media tools like blogs, Facebook, Twitter very popular and effective. People interact with each other, share their ideas, opinions, interests and personal information. These user comments are used for finding the sentiments and also add financial, commercial and social values. However, due to the enormous amount of user generated data, it is an expensive process to analyze the data manually. Increase in activity of opinion mining and sentiment analysis, challenges are getting added every day. There is a need for automated analysis techniques to extract sentiments and opinions conveyed in the user-comments. Sentiment analysis, also known as opinion mining is the computational study of sentiments and opinions conveyed in natural language for the purpose of decision making. Preprocessing data play a vital role in getting accurate sentiment analysis results. Extracting opinion target words provide fine-grained analysis on the customer reviews. The labeled data required for training a classifier is expensive and hence to over come, Domain Adaptation technique is used. In this technique, Single classifier is designed to classify homogeneous and heterogeneous input from di_erent domain. Sentiment Dictionary used to find the opinion about a word need to be consistent and a number of techniques are used to check the consistency of the dictionaries. This paper focuses on the survey of the existing methods of Sentiment analysis and Opinion mining techniques from social media

[PDF] from annalsofrscb.ro Predictive Analytics for Sentiment Classification of Social Media Data Using Deep Neural Network

A huge amount of user-generated data in the form of tweets or reviews on social media can be collected and analyzed for making informed decisions. This paper uses the novel deep learning model, namely the Elite Opposition-based Bat Algorithm for Deep Neural Network (EOBA-DNN) for performing polarity classification of the social media data. The proposed method includes three major steps, such as preprocessing, term weighting, and sentiment classification for identifying the polarity of the data. The results show that the EOBA-DNN outperforms other existing algorithms with improved accuracy for Sentiment Classification

Mathematical model of semantic look-an efficient context driven search engine

The WorldWideWeb (WWW) is a huge conservatory of web pages. Search Engines are key applications that fetch web pages for the user query. In the current generation web architecture, search engines treat keywords provided by the user as isolated keywords without considering the context of the user query. This results in a lot of unrelated pages or links being displayed to the user. Semantic Web is based on the current web with a revised framework to display a more precise result set as response to a user query. The current web pages need to be annotated by finding relevant meta data to be added to each of them, so that they become useful to Semantic Web search engines. Semantic Look explores the context of user query by processing the Semantic information recorded in the web pages. It is compared with an existing algorithm called OntoLook and it is shown that Semantic Look is a better optimized search engine by being more than twice as fast as OntoLook

Multi-hop optimal position based opportunistic routing for wireless sensor networks

Wireless sensor network is a collection of a group of sensors connected to monitor an area of interest. Installation flexibility, mobility, reduced cost and scalability have given popularity to wireless sensor networks. Opportunistic routing is a routing protocol that takes the advantage of broadcasting nature of wireless sensor network for multi-hop communication. Considering the importance of communication between source-destination pairs in a wireless sensor network a Multi-hop Optimal position based Opportunistic Routing (MOOR) protocol is proposed in this paper. The algorithm chooses the path with minimum distance and number of hops between source and destination for transmission of data in the network. It is illustrated by simulation experiments that the proposed protocol has a good effect on End-to-End delay and lifetime of the network. In addition, it is observed that the average End-to-End delay is lesser for different simulation times when compared with existing EEOR protocol

Joint Channel and Interference Aware Cooperative Routing for Cognitive Radio Network

Cognitive Radio based network technology provides a promising solution for various types of real-time wireless communication by offering better spectrum utilization and resource allocation. Generally, the dynamic network topology, interference, channel switching and under-utilization of resource can degrade the network performance. Therefore, development of promising solution to obtain the desired performance is a challenging research topic in CRNs. Several researches have been carried out which have focused on development of routing protocol for CRNs to improve the performance. These routing protocols are classified as local and global routing which are mainly focused on overhead reduction and optimal route selection respectively. However, the conventional approaches suffer from various issues such as interflow-interference, channel switching delay and node overhearing problems which can progress towards the poor network performance. In this paper, our objective is to focus on the inter-flow interference, channel switching delay, and develop a cooperative communication based approaches where inter-flow interference and overhearing issues are mitigated using cooperative communication. Furthermore, Switching Delay and Interference (SDI) routing metric is developed to reduce the switching delay and also finally, a cooperative scheme of packet transmission is developed where direct or cooperative communication is selected for successful packet transmission. The proposed approach jointly considers channel and interference issue, hence it is known as Joint Cooperative Channel and Interference Aware Routing (JCIAR). The performance of proposed approach is compared with the existing techniques such as Primary User Aware k-hop route discovery scheme (PAK), AODV, CognitiveAODV, and Location-Aided Routing for CRN (LAUNCH) in terms of delay, packet delivery rate and throughput. The obtained result shows a significant improvement in network performance